Expected number of locally maximal solutions for random Boolean CSPs
نویسندگان
چکیده
For a large number of random Boolean constraint satisfaction problems, such as random k-SAT, we study how the number of locally maximal solutions evolves when constraints are added. We give the exponential order of the expected number of these distinguished solutions and prove it depends on the sensitivity of the allowed constraint functions only. As a by-product we provide a general tool for computing an upper bound of the satisfiability threshold for any problem of a large class of random Boolean CSPs.
منابع مشابه
Concentration of the number of solutions of random planted CSPs and Goldreich's one-way candidates
This paper shows that the logarithm of the number of solutions of a random planted k-SAT formula concentrates around a deterministic n-independent threshold. Specifically, if F ∗ k (α, n) is a random k-SAT formula on n variables, with clause density α and with a uniformly drawn planted solution, there exists a function φk(·) such that, besides for some α in a set of Lesbegue measure zero, we ha...
متن کاملThe complexity of counting locally maximal satisfying assignments of Boolean CSPs
We investigate the computational complexity of the problem of counting the locally maximal satisfying assignments of a Constraint Satisfaction Problem (CSP) over the Boolean domain {0, 1}. A satisfying assignment is locally maximal if any new assignment which is obtained from it by changing a 0 to a 1 is unsatisfying. For each constraint language Γ, #LocalMaxCSP(Γ) denotes the problem of counti...
متن کاملOn the Average Similarity Degree between Solutions of Random k-SAT and Random CSPs
Abstract To study the structure of solutions for random k-SAT and random CSPs, this paper introduces the concept of average similarity degree to characterize how solutions are similar to each other. It is proved that under certain conditions, as r (i.e. the ratio of constraints to variables) increases, the limit of average similarity degree when the number of variables approaches infinity exhib...
متن کاملBelief propagation algorithms for constraint satisfaction problems
Belief propagation algorithms for constraint satisfaction problems by Elitza Nikolaeva Maneva Doctor of Philosophy in Computer Science and the Designated Emphasis in Communication, Computation, and Statistics University of California, Berkeley Professor Alistair Sinclair, Chair We consider applications of belief propagation algorithms to Boolean constraint satisfaction problems (CSPs), such as ...
متن کاملPhase Transitions Workshop Program
Dimitris Achlioptas (UC Santa Cruz) On the solution space geometry of random CSPs For a number of random constraint satisfaction problems, such as random k-SAT and random graph coloring, we now have excellent estimates of the largest constraints-to-variables ratio for which they have solutions. These estimates imply that all known polynomialtime algorithms stop finding solutions much before sol...
متن کامل